Nilpotent Bases for a Class of Non-Integrable Distributions with Applications to Trajectory Generation for Nonholonomic Systems

This paper develops a constructive method for finding a nilpotent basis for a special class of smooth nonholonomic distributions. The main tool is the use of the Goursat normal form theorem which arises in the study of exterior differential systems. The results are applied to the problem of finding a set of nilpotent input vector fields for a nonholonomic control system, which can then used to construct explicit trajectories to drive the system between any two points. A kinematic model of a rolling penny is used to illustrate this approach. The methods presented here extend previous work using "chained form" and cast that work into a coordinate-free setting

Quantitative Performance Bounds in Biomolecular Circuits due to Temperature Uncertainty

Performance of biomolecular circuits is affected by changes in temperature, due to its influence on underlying reaction rate parameters. While these performance variations have been estimated using Monte Carlo simulations, how to analytically bound them is generally unclear. To address this, we apply control-theoretic representations of uncertainty to examples of different biomolecular circuits, developing a framework to represent uncertainty due to temperature. We estimate bounds on the steady-state performance of these circuits due to temperature uncertainty. Through an analysis of the linearised dynamics, we represent this uncertainty as a feedback uncertainty and bound the variation in the magnitude of the input-output transfer function, providing a estimate of the variation in frequency-domain properties. Finally, we bound the variation in the time trajectories, providing an estimate of variation in time-domain properties. These results should enable a framework for analytical characterisation of uncertainty in biomolecular circuit performance due to temperature variation and may help in estimating relative performance of different controllers

A group-theoretic approach to formalizing bootstrapping problems

The bootstrapping problem consists in designing agents that learn a model of themselves and the world, and utilize it to achieve useful tasks. It is different from other learning problems as the agent starts with uninterpreted observations and commands, and with minimal prior information about the world. In this paper, we give a mathematical formalization of this aspect of the problem. We argue that the vague constraint of having "no prior information" can be recast as a precise algebraic condition on the agent: that its behavior is invariant to particular classes of nuisances on the world, which we show can be well represented by actions of groups (diffeomorphisms, permutations, linear transformations) on observations and commands. We then introduce the class of bilinear gradient dynamics sensors (BGDS) as a candidate for learning generic robotic sensorimotor cascades. We show how framing the problem as rejection of group nuisances allows a compact and modular analysis of typical preprocessing stages, such as learning the topology of the sensors. We demonstrate learning and using such models on real-world range-finder and camera data from publicly available datasets

Real-valued average consensus over noisy quantized channels

This paper concerns the average consensus problem with the constraint of quantized communication between nodes. A broad class of algorithms is analyzed, in which the transmission strategy, which decides what value to communicate to the neighbours, can include various kinds of rounding, probabilistic quantization, and bounded noise. The arbitrariness of the transmission strategy is compensated by a feedback mechanism which can be interpreted as a self-inhibitory action. The result is that the average of the nodes state is not conserved across iterations, and the nodes do not converge to a consensus; however, we show that both errors can be made as small as desired. Bounds on these quantities involve the spectral properties of the graph and can be proved by employing elementary techniques of LTI systems analysis

Frequency-Weighted Model Reduction with Applications to Structured Models

In this paper, a frequency-weighted extension of a recently proposed model reduction method for linear systems is presented. The method uses convex optimization and can be used both with sample data and exact models. We also obtain bounds on the frequency-weighted error. The method is combined with a rank-minimization heuristic to approximate multiinput– multi-output systems.We also present two applications— environment compensation and simplification of interconnected models — where we argue the proposed methods are useful

Extremal Properties of Complex Networks

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph qualities for any arbitrary number of nodes and edges and analytically derive the form and properties of such networks

Decomposing GR(1) Games with Singleton Liveness Guarantees for Efficient Synthesis

Temporal logic based synthesis approaches are often used to find trajectories that are correct-by-construction for tasks in systems with complex behavior. Some examples of such tasks include synchronization for multi-agent hybrid systems, reactive motion planning for robots. However, the scalability of such approaches is of concern and at times a bottleneck when transitioning from theory to practice. In this paper, we identify a class of problems in the GR(1) fragment of linear-time temporal logic (LTL) where the synthesis problem allows for a decomposition that enables easy parallelization. This decomposition also reduces the alternation depth, resulting in more efficient synthesis. A multi-agent robot gridworld example with coordination tasks is presented to demonstrate the application of the developed ideas and also to perform empirical analysis for benchmarking the decomposition-based synthesis approach

Bootstrapping bilinear models of robotic sensorimotor cascades

We consider the bootstrapping problem, which consists in learning a model of the agent's sensors and actuators starting from zero prior information, and we take the problem of servoing as a cross-modal task to validate the learned models. We study the class of bilinear dynamics sensors, in which the derivative of the observations are a bilinear form of the control commands and the observations themselves. This class of models is simple yet general enough to represent the main phenomena of three representative robotics sensors (field sampler, camera, and range-finder), apparently very different from one another. It also allows a bootstrapping algorithm based on hebbian learning, and that leads to a simple and bioplausible control strategy. The convergence properties of learning and control are demonstrated with extensive simulations and by analytical arguments